infinitely many

См. также в других словарях:

• infinitely — adverb 1. without bounds (Freq. 1) he is infinitely wealthy • Syn: ↑boundlessly, ↑immeasurably • Derived from adjective: ↑immeasurable (for: ↑immeasur …   Useful english dictionary

• Many-worlds interpretation — The quantum mechanical Schrödinger s cat paradox according to the many worlds interpretation. In this interpretation every event is a branch point; the cat is both alive and dead, even before the box is opened, but the alive and dead cats are in… …   Wikipedia

• Futurama/Simpsons Infinitely Secret Crossover Crisis — Infobox comic book title title = Futurama/Simpsons Infinitely Secret Crossover Crisis imagesize = 150 caption = Cover of issue #1 schedule = format = limited = Y ongoing = 1shot = Humor = y publisher = Bongo Comics date = 2002 2003 issues = 2… …   Wikipedia

• Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

• analysis — /euh nal euh sis/, n., pl. analyses / seez /. 1. the separating of any material or abstract entity into its constituent elements (opposed to synthesis). 2. this process as a method of studying the nature of something or of determining its… …   Universalium

• probability theory — Math., Statistics. the theory of analyzing and making statements concerning the probability of the occurrence of uncertain events. Cf. probability (def. 4). [1830 40] * * * Branch of mathematics that deals with analysis of random events.… …   Universalium

• mathematics, philosophy of — Branch of philosophy concerned with the epistemology and ontology of mathematics. Early in the 20th century, three main schools of thought called logicism, formalism, and intuitionism arose to account for and resolve the crisis in the foundations …   Universalium

• McNaughton's Theorem — In automata theory, McNaughton s theorem refers to a theorem that asserts that the set of ω regular languages is identical to the set of languages recognizable by deterministic Muller automata. [1] This theorem is proven by supplying an algorithm …   Wikipedia

• König's lemma — or König s infinity lemma is a theorem in graph theory due to Dénes Kőnig (1936). It gives a sufficient condition for an infinite graph to have an infinitely long path. The computability aspects of this theorem have been thoroughly investigated… …   Wikipedia

• First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… …   Wikipedia

• Powerful number — A powerful number is a positive integer m that for every prime number p dividing m , p 2 also divides m . Equivalently, a powerful number is the product of a square and a cube, that is, a number m of the form m = a 2 b 3, where a and b are… …   Wikipedia